Relations between adjacency trees

نویسندگان

  • John G. Stell
  • Michael F. Worboys
چکیده

Adjacency trees can model the nesting structure of spatial regions. In many applications it is necessary to model foreground and background regions which exhibit changes over time such as splitting, where one region divides into two. For example, the qualitative description of the development of wildfires would use the foreground for areas on fire and the background for areas not on fire. Such dynamic behaviour can be modelled by a particular kind of relation between the nodes of two adjacency trees representing the initial and final configurations of the regions at two times. These relations, which we call bipartite, correspond to having an arbitrary relation between the foreground regions at the two times and an arbitrary relation between the background regions at the two times. We show that all bipartite relations between trees arise from sequences of atomic relations between trees. There are just four types of these atomic relations (in addition to one representing no change): inserts, splits, merges and deletes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On relations between connected and self-avoiding walks on a graph

The characterization of a graph via the variable adjacency matrix enables to de ne a partially ordered relation on the walks. Studying the incidence algebra on this poset reveals unsuspected relations between connected and self-avoiding walks on the graph. These relations are derived by considering truncated versions of the characteristic polynomial of variable adjacency matrix, resulting in a ...

متن کامل

The machine learning process in applying spatial relations of residential plans based on samples and adjacency matrix

The current world is moving towards the development of hardware or software presence of artificial intelligence in all fields of human work, and architecture is no exception. Now this research seeks to present a theoretical and practical model of intuitive design intelligence that shows the problem of learning layout and spatial relationships to artificial intelligence algorithms; Therefore, th...

متن کامل

Relations between connected and self-avoiding walks in a digraph

Walks in a directed graph can be given a partially ordered structure that extends to possibly unconnected objects, called hikes. Studying the incidence algebra on this poset reveals unsuspected relations between walks and self-avoiding hikes. These relations are derived by considering truncated versions of the characteristic polynomial of the weighted adjacency matrix, resulting in a collection...

متن کامل

Computing Topological Adjacency Relations Between Iso-contour s

Contoured charts are widely used to visualize 2D physical fields . Experts can identify global patterns and structures in a contoured chart by looking at the isocurves and reasoning about their spatial relations . We develop an algorithm for computing the topological adjacency relations between iso-contours . The algorithm is novel in that it grounds the computation of spatia l relations betwee...

متن کامل

Labeling Schemes for Bounded Degree Graphs

We investigate adjacency labeling schemes for graphs of bounded degree ∆ = O(1). In particular, we present an optimal (up to an additive constant) log n+ O(1) adjacency labeling scheme for bounded degree trees. The latter scheme is derived from a labeling scheme for bounded degree outerplanar graphs. Our results complement a similar bound recently obtained for bounded depth trees [Fraigniaud an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 412  شماره 

صفحات  -

تاریخ انتشار 2011